أدخل كلمة أو عبارة بأي لغة 👆
اللغة:
ترجمة وتحليل الكلمات عن طريق الذكاء الاصطناعي ChatGPT
في هذه الصفحة يمكنك الحصول على تحليل مفصل لكلمة أو عبارة باستخدام أفضل تقنيات الذكاء الاصطناعي المتوفرة اليوم:
- كيف يتم استخدام الكلمة في اللغة
- تردد الكلمة
- ما إذا كانت الكلمة تستخدم في كثير من الأحيان في اللغة المنطوقة أو المكتوبة
- خيارات الترجمة إلى الروسية أو الإسبانية، على التوالي
- أمثلة على استخدام الكلمة (عدة عبارات مع الترجمة)
- أصل الكلمة
symmetric linear programming - ترجمة إلى العربية
Successive Linear Programming; Sequential linear programming
symmetric linear programming
برمجة خطية متعادلة
linear programming
![planes]] (not shown). The linear programming problem is to find a point on the polyhedron that is on the plane with the highest possible value.](https://commons.wikimedia.org/wiki/Special:FilePath/3dpoly.svg?width=200 "planes]] (not shown). The linear programming problem is to find a point on the polyhedron that is on the plane with the highest possible value.")
![[[John von Neumann]]](https://commons.wikimedia.org/wiki/Special:FilePath/JohnvonNeumann-LosAlamos.gif?width=200 "[[John von Neumann]]")
![[[Leonid Kantorovich]]](https://commons.wikimedia.org/wiki/Special:FilePath/Leonid Kantorovich 1975.jpg?width=200 "[[Leonid Kantorovich]]")
![convex]] [[feasible region]] of possible values for those variables. In the two-variable case this region is in the shape of a convex [[simple polygon]].](https://commons.wikimedia.org/wiki/Special:FilePath/Linear Programming Feasible Region.svg?width=200 "convex]] [[feasible region]] of possible values for those variables. In the two-variable case this region is in the shape of a convex [[simple polygon]].")
PROGRAMMING METHOD TO ACHIEVE THE BEST OUTCOME IN A MATHEMATICAL MODEL
Linear program; Linear programme; 0-1 integer programming; Linear Programming; Linear optimization; Mixed integer programming; Lp solve; LP problem; 0–1 integer program; 0-1 linear programming; 0-1 integer program; Linear programmer; Linear programmers; Linear programs; Binary integer programming; Integer programs; Integer linear programs; 0-1 integer programs; Binary integer program; Binary integer programs; Mixed integer program; Mixed integer programs; Linear programming problem; Mixed integer linear programming; 1-0 linear programming; Integral linear program; Linear programming formulation; Linear optimisation; Linear programming Formulation; Integral polyhedron; Linear problem; LP duality; Complementary slackness; Algorithms for linear programming; Linear programming algorithms; Applications of linear programming; List of solvers for linear programming; List of linear programming solvers; History of linear programming; MILP
برمجة خطية
linear program
PROGRAMMING METHOD TO ACHIEVE THE BEST OUTCOME IN A MATHEMATICAL MODEL
Linear program; Linear programme; 0-1 integer programming; Linear Programming; Linear optimization; Mixed integer programming; Lp solve; LP problem; 0–1 integer program; 0-1 linear programming; 0-1 integer program; Linear programmer; Linear programmers; Linear programs; Binary integer programming; Integer programs; Integer linear programs; 0-1 integer programs; Binary integer program; Binary integer programs; Mixed integer program; Mixed integer programs; Linear programming problem; Mixed integer linear programming; 1-0 linear programming; Integral linear program; Linear programming formulation; Linear optimisation; Linear programming Formulation; Integral polyhedron; Linear problem; LP duality; Complementary slackness; Algorithms for linear programming; Linear programming algorithms; Applications of linear programming; List of solvers for linear programming; List of linear programming solvers; History of linear programming; MILP
برنامج خطي
تعريف
linear programming
<application> A procedure for finding the maximum or minimum
of a linear function where the arguments are subject to
linear constraints. The simplex method is one well known
algorithm.
(1995-04-06)
ويكيبيديا
Successive linear programming
Successive Linear Programming (SLP), also known as Sequential Linear Programming, is an optimization technique for approximately solving nonlinear optimization problems.
Starting at some estimate of the optimal solution, the method is based on solving a sequence of first-order approximations (i.e. linearizations) of the model. The linearizations are linear programming problems, which can be solved efficiently. As the linearizations need not be bounded, trust regions or similar techniques are needed to ensure convergence in theory.
SLP has been used widely in the petrochemical industry since the 1970s.
